Generating databases for query workloads
نویسندگان
چکیده
منابع مشابه
Generating Databases for Query Workloads
To evaluate the performance of database applications and DBMSs, we usually execute workloads of queries on generated databases of different sizes and measure the response time. This paper introduces MyBenchmark, an offline data generation tool that takes a set of queries as input and generates database instances for which the users can control the characteristics of the resulting workload. Appl...
متن کاملGenerating Databases for Query Workloads (Full Version)
To evaluate the performance of database applications and DBMSs, we usually execute workloads of queries on generated databases of different sizes and measure the response time. This paper introduces WAGEN, an offline data generation tool that takes a set of queries as input and generates database instances for which the users can control the characteristics of the resulting workload. Applicatio...
متن کاملGenerating Flexible Workloads for Graph Databases
Graph data management tools are nowadays evolving at a great pace. Key drivers of progress in the design and study of data intensive systems are solutions for synthetic generation of data and workloads, for use in empirical studies. Current graph generators, however, provide limited or no support for workload generation or are limited to fixed use-cases. Towards addressing these limitations, we...
متن کاملGenerating efficient safe query plans for probabilistic databases
Managing uncertain information using probabilistic databases has drawn much attention recently in many fields such as information retrieval, multimedia database and sensor data management. Differing from conventional databases which maintain certain data, probabilistic databases manage data with probability. A query plan applicable to a conventional database may generate incorrect composite pro...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2010
ISSN: 2150-8097
DOI: 10.14778/1920841.1920950